program semantics

On Program Semantics of Dynamic Data Structures

论动态数据结构的程序语义

Programs have appeared as O_expressions ( expressions of operations on physical objects) and program semantics are given by axioms on O_expressions.

程序以操作表达式的形式呈现，而其语义则以公理的形式给出。

In this paper, the semantics of Verilog program are studied in a discrete continuous hybrid time model, a hybrid interval is denoted as the description of a run of Verilog program.

在连续离散混合时间模型中考虑Verilog的语义行为，将混合模型中的一个区间作为Verilog程序一次运行过程的指称。

So, this paper addresses how to define program semantics on dynamic data structures.

本文针对这种情况，研究了如何正确刻划动态数据结构的程序语义问题。

The partial weakest precondition is another way to represent the over-approximated program semantics, and its definition is also based on variable abstraction.

部分最弱前置条件是程序保守近似语义的另一种表示方法，同样基于变量抽象定义。

We then present the partial strongest post-condition, which represents the over-approximated program semantics.

基于变量抽象，我们定义了部分最强后置条件，进而定义了程序的保守近似语义。

Constrasted with other semantics theories of nonmonotonic logic programming, Answer Set semantics, the kernel of Answer Set programming technology, is concise and simple, and fully utilizes the fruits acquired by the logic programming community, and effectively realizes nonmonotonic reasoning of the logic program.

作为该类编程技术的核心，Answer Set语义相对其它非单调逻辑编程语义理论简洁明了，它充分利用了逻辑编程领域的已有成果，有效地实现了逻辑程序的非单调推理。